MCA: an end-to-end multicast congestion avoidance scheme with feedback suppression
نویسندگان
چکیده
In this paper, we propose MCA, an end-to-end multicast congestion avoidance scheme with feedback suppression. Congestion avoidance [7] is different from congestion control in the sense that our scheme detects and responds to network congestion without necessarily inducing packet loss. Our scheme is a single-rate scheme and operates end-to-end, i.e. the sending rate is controlled by the source based on feedback from the most congested receiver and does not expect packet marking or other support from intermediate nodes. We design it to be robust under both lossless and lossy situations. Congestion is detected at receivers using the concept of “accumulation” (the number of buffered bits of a flow inside the network) and simple thresholding techniques proposed in our recent unicast work [22]. For the purposes of choosing representative (the most congested receiver) by the source and suppressing feedback by receivers, each receiver maintains its Good Throughput Rate At Congestion (GTRAC) (the product of receiving rate during congestion epochs and 1− f , where f is congestion occurrence frequency). In this way, receivers do not need to continuously (either densely or sparsely) exchange packets with the sender (e.g. to measure RTT). Therefore, MCA is scalable for large-size groups. We evaluate the design and demonstrate the performance of MCA using detailed ns-2 simulations.
منابع مشابه
MCA: a rate-based end-to-end multicast congestion avoidance scheme
We propose MCA, a rate-based end-to-end multicast congestion avoidance scheme. Congestion avoidance [6] is different from congestion control in the sense that our scheme detects and responds to network congestion without necessarily inducing packet loss. Our scheme is a single-rate scheme and operates endto-end, i.e., it goes at the rate allowed by the worst congested receiver and does not expe...
متن کاملExplicit rate multicast congestion control
In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC (Throughput Rate At Congestion). ERMCC can be implemented only at the source and the receivers of the multicast tree. ERMCC achieves an O(1) memory complexity to maintain state information at source and receivers; requ...
متن کاملREIHE INFORMATIK 13/2001 Extending Equation-based Congestion Control to Multicast Applications
In this paper we introduce TFMCC, an equation-based multicast congestion control mechanism that extends the TCPfriendly TFRC protocol from the unicast to the multicast domain. The key challenges in the design of TFMCC lie in scalable round-trip time measurements, appropriate feedback suppression, and in ensuring that feedback delays in the control loop do not adversely affect fairness towards c...
متن کاملExtending the Real Rime Congestion Control Mechanism for Multicast Applications over 3G Wireless Networks
In this paper we introduce a real time congestion control mechanism to multicast the multimedia applications. The key challenge in the design of this mechanism is to calculate the rate of feedback messages by various receivers; appropriate feed back suppression, scalable round trip time measurements & ensuring that feedback delays in the control loop do not adversely affect fairness towards com...
متن کاملEquation-based congestion control for unicast and multicast data streams
We believe that the emergence of congestion control mechanisms for relatively-smooth congestion control for unicast and multicast traffic can play a key role in preventing the degradation of end-to-end congestion control in the public Internet, by providing a viable alternative for multimedia flows that would otherwise be tempted to avoid end-to-end congestion control altogether. The design of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 27 شماره
صفحات -
تاریخ انتشار 2004